A Secure Sketch for Set Reconciliation
نویسندگان
چکیده
In this paper we present an implementation of an algorithm for creating a secure sketch for the set difference as defined in [1]. This sketch is a short, efficiently computable description of a set such that, given a second set that differs only in a small percentage of elements, the original can be reconstructed. However, this sketch is secure in the sense that in the absence of such a similar set, as little information as possible can be obtained about the elements of the original. This work has applications in cryptography and database synchronization.
منابع مشابه
Secure Sketch for Multi-Sets
Given the original set X where |X| = s, a sketch P is computed from X and made public. From another set Y where |Y | = s and P , we can reconstruct X if |X ∩ Y | ≥ |s − t|, where t < s is some threshold. The sketch P is secure if it does not reveal much information about X. A few constructions have been proposed, but they cannot handle multi-sets, that is, sets that may contain duplicate elemen...
متن کاملPrivacy-Preserving Multi-Party Reconciliation Secure in the Malicious Model
The problem of fair and privacy-preserving ordered set reconciliation arises in a variety of applications like auctions, e-voting, and appointment reconciliation. While several multi-party protocols have been proposed that solve this problem in the semi-honest model, there are no multi-party protocols that are secure in the malicious model so far. In this paper, we close this gap. Our newly pro...
متن کاملSmall Secure Sketch for Point-Set Difference
A secure sketch is a set of published data that can help to recover the original biometric data after they are corrupted by permissible noises, and by itself does not reveal much information about the original. Several constructions have been proposed for different metrics, and in particular, set difference. We observe that in many promising applications, set difference alone is insufficient to...
متن کاملEternal m- Security Subdivision Numbers in Graphs
Let be a simple graph with vertex set and edges set . A set is a dominating set if every vertex in is adjacent to at least one vertex in . An eternal 1-secure set of a graph G is defined as a dominating set such that for any positive integer k and any sequence of vertices, there exists a sequence of guards with and either or and is a dominating set. If we take a guard on every ver...
متن کاملAligning Medication Reconciliation and Secure Messaging: Qualitative Study of Primary Care Providers’ Perspectives
BACKGROUND Virtual (non-face-to-face) medication reconciliation strategies may reduce adverse drug events (ADEs) among vulnerable ambulatory patients. Understanding provider perspectives on the use of technology for medication reconciliation can inform the design of patient-centered solutions to improve ambulatory medication safety. OBJECTIVE The aim of the study was to describe primary care ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005